Local Computability of Computable Metric Spaces and Computability of Co-c.e. Continua
نویسندگان
چکیده
We investigate conditions on a computable metric space under which each co-computably enumerable set satisfying certain topological properties must be computable. We examine the notion of local computability and show that the result by which in a computable metric space which has the effective covering property and compact closed balls each co-c.e. circularly chainable continuum which is not chainable must be computable can be generalized to computable metric spaces which have the effective covering property and which are locally compact. We also give examples which show that neither of these two assumptions can be omitted.
منابع مشابه
Computable Banach Spaces via Domain Theory 1
This paper extends the domain-theoretic approach to computable analysis to complete metric spaces and Banach spaces. We employ the domain of formal balls to deene a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of closed balls, ordered by reversed inclusion. We characterise computable linear operators as those which map computable seque...
متن کاملComputable Banach Spaces via
This paper extends the order-theoretic approach to computable analysis via continuous domains to complete metric spaces and Banach spaces. We employ the domain of formal balls to deene a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of closed balls, ordered by reversed inclusion. We characterise computable linear operators as those whic...
متن کاملChainable and Circularly Chainable Co-r.e. Sets in Computable Metric Spaces
We investigate under what conditions a co-recursively enumerable set S in a computable metric space (X, d, α) is recursive. The topological properties of S play an important role in view of this task. We first study some properties of computable metric spaces such as the effective covering property. Then we examine co-r.e. sets with disconnected complement, and finally we focus on study of chai...
متن کاملOn the Turing Degrees of Divergence Bounded Computable Reals
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆2-reals which have very interesting computability-theoretical as well as very nice analytical properties. Recently, Downey, Wu and Zheng [2] have shown by a double witness technique that not every ∆2-Turing degree contains a d-c.e. real. In this paper we show that the classes of Turing...
متن کاملUniform Procedures in Uncountable Structures
This paper contributes to the general program of extending techniques and ideas of effective algebra to computable metric space theory. It is well-known that relative computable categoricity (to be defined) of a computable algebraic structure is equivalent to having a c.e. Scott family with finitely many parameters (e.g., [1]). The first main result of the paper extends this characterisation to...
متن کامل